全文获取类型
收费全文 | 2403篇 |
免费 | 159篇 |
国内免费 | 75篇 |
专业分类
化学 | 74篇 |
晶体学 | 1篇 |
力学 | 4篇 |
综合类 | 31篇 |
数学 | 2428篇 |
物理学 | 99篇 |
出版年
2024年 | 3篇 |
2023年 | 46篇 |
2022年 | 62篇 |
2021年 | 45篇 |
2020年 | 98篇 |
2019年 | 92篇 |
2018年 | 86篇 |
2017年 | 83篇 |
2016年 | 57篇 |
2015年 | 47篇 |
2014年 | 81篇 |
2013年 | 207篇 |
2012年 | 68篇 |
2011年 | 125篇 |
2010年 | 128篇 |
2009年 | 231篇 |
2008年 | 185篇 |
2007年 | 139篇 |
2006年 | 146篇 |
2005年 | 86篇 |
2004年 | 84篇 |
2003年 | 82篇 |
2002年 | 69篇 |
2001年 | 57篇 |
2000年 | 56篇 |
1999年 | 51篇 |
1998年 | 44篇 |
1997年 | 37篇 |
1996年 | 21篇 |
1995年 | 7篇 |
1994年 | 13篇 |
1993年 | 13篇 |
1992年 | 8篇 |
1991年 | 8篇 |
1990年 | 11篇 |
1989年 | 11篇 |
1988年 | 9篇 |
1987年 | 2篇 |
1986年 | 3篇 |
1985年 | 11篇 |
1984年 | 10篇 |
1983年 | 3篇 |
1982年 | 4篇 |
1981年 | 2篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1978年 | 2篇 |
1977年 | 1篇 |
1970年 | 1篇 |
排序方式: 共有2637条查询结果,搜索用时 31 毫秒
41.
A (p, q)-sigraph S is an ordered pair (G, s) where G = (V, E) is a (p, q)-graph and s is a function which assigns to each edge of G a positive or a negative sign. Let the sets E
+ and E
– consist of m positive and n negative edges of G, respectively, where m + n = q. Given positive integers k and d, S is said to be (k, d)-graceful if the vertices of G can be labeled with distinct integers from the set {0, 1, ..., k + (q – 1)d such that when each edge uv of G is assigned the product of its sign and the absolute difference of the integers assigned to u and v the edges in E
+ and E
– are labeled k, k + d, k + 2d, ..., k + (m – 1)d and –k, – (k + d), – (k + 2d), ..., – (k + (n – 1)d), respectively.In this paper, we report results of our preliminary investigation on the above new notion, which indeed generalises the well-known concept of (k, d)-graceful graphs due to B. D. Acharya and S. M. Hegde. 相似文献
42.
Let G = (V,E) be a graph or digraph and r : V → Z+. An r‐detachment of G is a graph H obtained by ‘splitting’ each vertex ν ∈ V into r(ν) vertices. The vertices ν1,…,νr(ν) obtained by splitting ν are called the pieces of ν in H. Every edge uν ∈ E corresponds to an edge of H connecting some piece of u to some piece of ν. Crispin Nash‐Williams 9 gave necessary and sufficient conditions for a graph to have a k‐edge‐connected r‐detachment. He also solved the version where the degrees of all the pieces are specified. In this paper, we solve the same problems for directed graphs. We also give a simple and self‐contained new proof for the undirected result. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 67–77, 2003 相似文献
43.
For each infinite cardinal κ, we give examples of 2κ many non‐isomorphic vertex‐transitive graphs of order κ that are pairwise isomorphic to induced subgraphs of each other. We consider examples of graphs with these properties that are also universal, in the sense that they embed all graphs with smaller orders as induced subgraphs. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 99–106, 2003 相似文献
44.
Jochen Alber Jií Fiala 《Journal of Algorithms in Cognition, Informatics and Logic》2004,52(2):134-151
We consider the parameterized problem, whether for a given set
of n disks (of bounded radius ratio) in the Euclidean plane there exists a set of k non-intersecting disks. For this problem, we expose an algorithm running in time
that is—to our knowledge—the first algorithm with running time bounded by an exponential with a sublinear exponent. For λ-precision disk graphs of bounded radius ratio, we show that the problem is fixed parameter tractable with a running time
. The results are based on problem kernelization and a new “geometric (
-separator) theorem” which holds for all disk graphs of bounded radius ratio. The presented algorithm then performs, in a first step, a “geometric problem kernelization” and, in a second step, uses divide-and-conquer based on our new “geometric separator theorem.” 相似文献
45.
PSN is a fast forward permutation if for each m the computational complexity of evaluating Pm(x) is small independently of m and x. Naor and Reingold constructed fast forward pseudorandom cycluses and involutions. By studying the evolution of permutation graphs, we prove that the number of queries needed to distinguish a random cyclus from a random permutation in SN is Θ(N) if one does not use queries of the form Pm(x), but is only Θ(1) if one is allowed to make such queries. We construct fast forward permutations which are indistinguishable from random permutations even when queries of the form Pm(x) are allowed. This is done by introducing an efficient method to sample the cycle structure of a random permutation, which in turn solves an open problem of Naor and Reingold. 相似文献
46.
Michel Vasquez 《Journal of Heuristics》2004,10(4):407-413
For the Queens_n
2 graph coloring problems no chromatic numbers are available for n > 9 except where n is not a multiple of 2 or 3. In this paper we propose an exact algorithm that takes advantage of the particular structure of these graphs. The algorithm works on the independent sets of the graph rather than on the vertices to be colored. It combines branch and bound, for independent set assignment, with a clique based filtering procedure. A first experimentation of this approach provided the coloring number values ranging for n = 10 to n = 14. 相似文献
47.
Andrew V. Goldberg Michael D. Grigoriadis Robert E. Tarjan 《Mathematical Programming》1991,50(1-3):277-290
Goldfarb and Hao (1990) have proposed a pivot rule for the primal network simplex algorithm that will solve a maximum flow problem on ann-vertex,m-arc network in at mostnm pivots and O(n
2
m) time. In this paper we describe how to extend the dynamic tree data structure of Sleator and Tarjan (1983, 1985) to reduce the running time of this algorithm to O(nm logn). This bound is less than a logarithmic factor larger than those of the fastest known algorithms for the problem. Our extension of dynamic trees is interesting in its own right and may well have additional applications.Research partially supported by a Presidential Young Investigator Award from the National Science Foundation, Grant No. CCR-8858097, an IBM Faculty Development Award, and AT&T Bell Laboratories.Research partially supported by the Office of Naval Research, Contract No. N00014-87-K-0467.Research partially supported by the National Science Foundation, Grant No. DCR-8605961, and the Office of Naval Research, Contract No. N00014-87-K-0467. 相似文献
48.
Axel Kohnert 《Discrete Applied Mathematics》2007,155(11):1451-1457
We construct new linear two-weight codes over the finite field with q elements. To do so we solve the equivalent problem of finding point sets in the projective geometry with certain intersection properties. These point sets are in bijection to solutions of a Diophantine linear system of equations. To reduce the size of the system of equations we restrict the search for solutions to solutions with special symmetries.Two-weight codes can be used to define strongly regular graphs. We give tables of the two-weight codes and the corresponding strongly regular graphs. In some cases we find new distance-optimal two-weight codes and also new strongly regular graphs. 相似文献
49.
Ronald I. Becker Isabella Lari Andrea Scozzari Giovanni Storchi 《Annals of Operations Research》2007,150(1):65-78
In this paper we consider the location of a path shaped facility on a grid graph. In the literature this problem was extensively
studied on particular classes of graphs as trees or series-parallel graphs. We consider here the problem of finding a path
which minimizes the sum of the (shortest) distances from it to the other vertices of the grid, where the path is also subject
to an additional constraint that takes the form either of the length of the path or of the cardinality. We study the complexity
of these problems and we find two polynomial time algorithms for two special cases, with time complexity of O(n) and O(nℓ) respectively, where n is the number of vertices of the grid and ℓ is the cardinality of the path to be located.
The literature about locating dimensional facilities distinguishes between the location of extensive facilities in continuous
spaces and network facility location. We will show that the problems presented here have a close connection with continuous
dimensional facility problems, so that the procedures provided can also be useful for solving some open problems of dimensional
facilities location in the continuous case. 相似文献
50.
如果一个图G存在一个k-列表安排使得G具有一个唯一列表染色,则称 G是唯一列表可染色图,简称UkLC图.我们称图G具有M(k)性质当且仅当G不 是UkLC图.本文在借鉴θr,s,t-图概念的基础上引入θr,s,t-图的定义,并证明:除了 r=s=t=2以外,θr,s,t-图都是U2LC图.利用如上结果我们给出M.Mahdian and E.S.Mahmoodian对U2LC图所作特征化的一个简单证明. 相似文献